机动作战路线选择辅助决策系统模型研究

为了更好地评价机动作战路线的优劣,运用模糊数学的方法,结合机动路线选择的特点,建立了机动路线选择的指标体系,采用层次分析法(AHP)对指标体系的各个因素的权重进行了确定,并在模型的基础上对机动路线选择辅助决策系统的软件设计进行了构思。利用辅助决策软件对机动作战路线选择,快捷方便,特别是能够在多条路线中选取最优,实现了由定性分析转入定量分析的轨道,有助于提高指挥决策的科学性和客观性。     

地空导弹阵地优选的灰色关联模型研究

依据地空导弹阵地优选受多因素制约的特点,运用灰色关联分析建立地空导弹阵地优选的灰色关联模型。通过综合研究地空导弹阵地选择的战术、技术要求及影响因素,提出了阵地选择的指标体系,进而结合使用Delphi法,建立了地空导弹阵地优选的灰色关联模型。经过实例计算证明了该模型具有实用性和推广价值。     

机动车辆自动识别系统

基于视觉的机动车辆自动识别方法工程量小、检测范围大、系统安装相对灵活，是一种很有前途的方法。目前已开发的商业系统大都用在日间辅助交通管理上。为改善视觉交通检测系统的实用性和增强系统的功能，本文作者对模型系统进行了深入的理论研究，提出了２．５维图像的新思路，提取车辆外形的综和特征更为准确，自适应识别方案使车型识别准确灵活，车头颜色特征的利用使识别的准确性进一步提高。实验证明，系统对光线的适应能力也明显增强，系统的稳定性得到改善，有望扩大系统的使用范围。     

基于选择准则的参数模型评价方法

为评价参数模型的优劣,分析了模型信息量与数据被模型拟合后的残差信息量之间的关系,提出了综合考虑模型拟合残差大小、残差信息量与参数数目的一种模型选择的新方法RIA。结合RIA方法,定义了时序模型评价的一种准则,并以航天测量数据处理为例,说明了不同模型在工程实际中的不同表现和本质区别的意义所在。     

针对无线移动环境的音频同步视频连环画的自动生成

针对无线移动通信网络的客观制约,给出了一种音频同步的基于视频连环画模式摘要自动生成的实用视频服务方案,使得系统在向用户提交连续音频流的同时,能够随着网络带宽条件的变化,按照动态采样频率,基于视频内容选择重要帧递送,并按照与音轨同步的模式播放,从而在降低数据量的同时,满足用户对视频内容综合理解的需求。     

模糊多属性群决策与潜艇作战方案优选

分析了潜艇作战方案的优选实质是一个模糊多属性的群决策过程,建立了模糊多属性群决策的一般模型,介绍了一种以模糊理想解与模糊负理想解同时作为参照基准,以海明距离作为测度工具,以相对贴近度作为衡量标准的模糊折衷型多属性群决策方法,应用实例表明此方法可行有效。     

A selective newsvendor approach to order management

Consider a supplier offering a product to several potential demand sources, each with a unique revenue, size, and probability that it will materialize. Given a long procurement lead time, the supplier must choose the orders to pursue and the total quantity to procure prior to the selling season. We model this as a selective newsvendor problem of maximizing profits where the total (random) demand is given by the set of pursued orders. Given that the dimensionality of a mixed‐integer linear programming formulation of the problem increases exponentially with the number of potential orders, we develop both a tailored exact algorithm based on the L‐shaped method for two‐stage stochastic programming as well as a heuristic method. We also extend our solution approach to account for piecewise‐linear cost and revenue functions as well as a multiperiod setting. Extensive experimentation indicates that our exact approach rapidly finds optimal solutions with three times as many orders as a state‐of‐the‐art commercial solver. In addition, our heuristic approach provides average gaps of less than 1% for the largest problems that can be solved exactly. Observing that the gaps decrease as problem size grows, we expect the heuristic approach to work well for large problem instances. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

基于蚁群算法和禁忌搜索的部队机动路径选择

高技术条件下的现代战争对部队机动路径选择问题提出了新要求,一方面道路网的扩大使问题求解的规模大大增加,另一方面作战环境和任务的变化使得问题本身不得不从多角度进行综合评价.增加了问题的复杂性.针对问题建立了数学模型,引入信息熵理论作为目标评价准则,借助改进的蚁群算法、禁忌搜索算法相结合的启发式方法对问题进行求解,得到了令人满意的结果.仿真结果分析认为,算法是切实有效的,并且具有良好的稳定性.     

Fully sequential procedures for comparing constrained systems via simulation

We consider the problem of finding the system with the best primary performance measure among a finite number of simulated systems in the presence of a stochastic constraint on a single real‐valued secondary performance measure. Solving this problem requires the identification and removal from consideration of infeasible systems (Phase I) and of systems whose primary performance measure is dominated by that of other feasible systems (Phase II). We use indifference zones in both phases and consider two approaches, namely, carrying out Phases I and II sequentially and carrying out Phases I and II simultaneously, and we provide specific example procedures of each type. We present theoretical results guaranteeing that our approaches (general and specific, sequential and simultaneous) yield the best system with at least a prespecified probability, and we provide a portion of an extensive numerical study aimed at evaluating and comparing the performance of our approaches. The experimental results show that both new procedures are useful for constrained ranking and selection, with neither procedure showing uniform superiority over the other.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

On the polyhedral structure of two‐level lot‐sizing problems with supplier selection

In this article, we study a two‐level lot‐sizing problem with supplier selection (LSS), which is an NP‐hard problem arising in different production planning and supply chain management applications. After presenting various formulations for LSS, and computationally comparing their strengths, we explore the polyhedral structure of one of these formulations. For this formulation, we derive several families of strong valid inequalities, and provide conditions under which they are facet‐defining. We show numerically that incorporating these valid inequalities within a branch‐and‐cut framework leads to significant improvements in computation. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 647–666, 2017